منابع مشابه
The Densest Geodesic Ball Packing by a Type of Nil Lattices
W. Heisenberg’s famous real matrix group provides a noncommutative translation group of an affine 3-space. The Nil geometry which is one of the eight homogeneous Thurston 3-geometries, can be derived from this matrix group. E. Molnár proved in [2], that the homogeneous 3-spaces have a unified interpretation in the projective 3-sphere PS(V4,V 4,R). In our work we will use this projective model o...
متن کاملThe Densest Hemisphere Problem
DD i j a n M73 1473 E D I T I O N O F 1 N O V 65 I S O B S O L E T E __________________U N C L A S S I F I E D _______________________ _ S E C U R I T Y C L A S S I F I C A T I O N O F T H I S P A G E (When Data Entered) SECURITY CLASSIFICATION OP THIS PAPE (When D a ta Entered) «
متن کاملThe Densest k-Subhypergraph Problem
The Densest k-Subgraph (DkS) problem, and its corresponding minimization problem Smallest p-Edge Subgraph (SpES), have come to play a central role in approximation algorithms. This is due both to their practical importance, and their usefulness as a tool for solving and establishing approximation bounds for other problems. These two problems are not well understood, and it is widely believed th...
متن کاملDensest binary sphere packings.
The densest binary sphere packings in the α-x plane of small to large sphere radius ratio α and small sphere relative concentration x have historically been very difficult to determine. Previous research had led to the prediction that these packings were composed of a few known "alloy" phases including, for example, the AlB(2) (hexagonal ω), HgBr(2), and AuTe(2) structures, and to XY(n) structu...
متن کاملThe Computational Complexity of Densest Region Detection
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal learning model for this task that uses a hypothesis class as its ‘antioverfitting’ mechanism. The learning task in our model can be reduced to a combinatorial optimization problem. We can show that for some constants, d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2013
ISSN: 0001-8708
DOI: 10.1016/j.aim.2013.04.003